Level-3 BLAS and LU Factorization on a Matrix Processor
نویسندگان
چکیده
منابع مشابه
On a Special Generalized Vandermonde Matrix and Its Lu Factorization
We consider a special class of the generalized Vandermonde matrices and obtain an LU factorization for its member by giving closed-form formulae of the entries of L and U . Moreover, we express the matrices L and U as products of 1-banded (bidiagonal) matrices. Our result is applied to give the closed-form formula of the inverse of the considered matrix.
متن کاملRecursive approach in sparse matrix LU factorization
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for...
متن کاملRandom matrix over a DVR and LU factorization
LetR be a discrete valuation ring (DVR) andK be its fraction field. IfM is a matrix overR admitting a LU decomposition, it could happen that the entries of the factors L and U do not lie in R, but just inK. Having a good control on the valuations of these entries is very important for algorithmic applications. In the paper, we prove that in average these valuations are not too large and explain...
متن کاملOn Level Scheduling for Incomplete LU Factorization Preconditioners on Accelerators
The application of the finite element method for the numerical solution of partial differential equations naturally leads tolarge systems of linear equations represented by a sparse system matrix A and right hand side b. These systems are commonly solved using iterative solvers, particularly Krylov subspace methods, which are typically accelerated using preconditioners to obtain good convergenc...
متن کاملGemmw: a Portable Level 3 Blas Winograd Variant of Strassen's Matrix{matrix Multiply Algorithm
Matrix{matrix multiplication is normally computed using one of the BLAS or a reinvention of part of the BLAS. Unfortunately, the BLAS were designed with small matrices in mind. When huge, well conditioned matrices are multiplied together, the BLAS perform like the blahs, even on vector machines. For matrices where the coe cients are well conditioned, Winograd's variant of Strassen's algorithm o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2008
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.4.151